The Average Lower Connectivity of Graphs
نویسندگان
چکیده
منابع مشابه
Average connectivity and average edge-connectivity in graphs
Connectivity and edge-connectivity of a graph measure the difficulty of breaking the graph apart, but they are very much affected by local aspects like vertex degree. Average connectivity (and analogously, average edge-connectivity) has been introduced to give a more refined measure of the global “amount” of connectivity. In this paper, we prove a relationship between the average connectivity a...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملThe Average Lower Independence Number of Total Graphs
In communication networks, ”vulnerability” indicates the resistance of a network to disruptions in communication after a breakdown of some processors or communication links. We may use graphs to model networks, as graph theoretical parameters can be used to describe the stability and reliability of communication networks If we think of a graph as modeling a network, the average lower independen...
متن کاملOn the Average Lower Independence Number of Some Graphs
In a communication network, several vulnerability measures are used to determine the resistance of the network to disruption of operation after the failure of certain stations or communication links. If the communication network is modeled as a simple, undirected, connected and unweighted graph G, then average lower independence number of a graph G can be considered as a measure of graph vulner...
متن کاملAverage Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/807834